<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/DFNNa</identifier>
		<repository>sid.inpe.br/banon/2004/10.06.16.04</repository>
		<lastupdate>2004:10.06.03.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2004/10.06.16.04.24</metadatarepository>
		<metadatalastupdate>2022:06.14.00.12.51 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2004}</metadatalastupdate>
		<doi>10.1109/SIBGRA.2004.1352969</doi>
		<citationkey>ParariEspeOlivCava:2004:FaPoVa</citationkey>
		<title>Fast Polygonization of Variational Implicit Surfaces</title>
		<format>On-line</format>
		<year>2004</year>
		<numberoffiles>1</numberoffiles>
		<size>408 KiB</size>
		<author>Parari, Alvaro Cuno,</author>
		<author>Esperança, Claudio,</author>
		<author>Oliveira, Antonio Alberto Fernandes de,</author>
		<author>Cavalcanti, Paulo Roma,</author>
		<affiliation>COPPE/UFRJ</affiliation>
		<editor>Araújo, Arnaldo de Albuquerque,</editor>
		<editor>Comba, João Luiz Dihl,</editor>
		<editor>Navazo, Isabel,</editor>
		<editor>Sousa, Antônio Augusto de,</editor>
		<e-mailaddress>esperanc@lcg.ufrj.br</e-mailaddress>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)</conferencename>
		<conferencelocation>Curitiba, PR, Brazil</conferencelocation>
		<date>17-20 Oct. 2004</date>
		<publisher>IEEE Computer Society</publisher>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>polygonization, implicit surfaces, RBF.</keywords>
		<abstract>This article presents a simple hierarchical adaptation of the Marching Cubes algorithm for polygonizing variational implicit surfaces used in modelling and reconstruction applications. The technique relies on placing the normal and boundary constraint points respecting a pseudo-Euclidean distance metrics. This procedure makes it possible to quickly prune the space and minimize the number of costly function evaluations and thus converge rapidly to the surface. Timings show that this technique tends to perform faster than Bloomenthal's continuation polygonizer.</abstract>
		<language>en</language>
		<targetfile>vispoly_paper.pdf</targetfile>
		<usergroup>esperanc administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46QM2BE</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/05.03.00.29 7</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2004/10.06.16.04</url>
	</metadata>
</metadatalist>